Memory Hierarchies for Quantum Data

نویسندگان

  • Dean Copsey
  • Mark Oskin
  • Frederic T. Chong
  • Isaac Chuang
  • Khaled Abdel-Ghaffar
چکیده

Computing with quantum states may be the most efficient approach to solving some problems which take exponential time on conventional computers. Quantum states, however, are short-lived without constant error correction involving tremendous overheads. We propose to reduce these overheads by storing quantum data in a hierarchical structure. Large groups of quantum bits can be encoded together to reduce overhead in mass storage, but smaller groups are needed to support the working set of a computation.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Energy Efficient Novel Design of Static Random Access Memory Memory Cell in Quantum-dot Cellular Automata Approach

This paper introduces a peculiar approach of designing Static Random Access Memory (SRAM) memory cell in Quantum-dot Cellular Automata (QCA) technique. The proposed design consists of one 3-input MG, one 5-input MG in addition to a (2×1) Multiplexer block utilizing the loop-based approach. The simulation results reveals the excellence of the proposed design. The proposed SRAM cell achieves 16% ...

متن کامل

Space-time Tradeoos in Memory Hierarchies Space-time Tradeoos in Memory Hierarchies

The speed of CPUs is accelerating rapidly, outstripping that of peripheral storage devices and making it increasingly di cult to keep CPUs busy. Multilevel memory hierarchies, scaled to simulate single-level memories, are increasing in importance. In this paper we introduce the Memory Hierarchy Game, a multi-level pebble game simulating data movement in memory hierarchies for straight-line comp...

متن کامل

Doing More for Less -- Cache-Aware Parallel Contraction Hierarchies Preprocessing

Contraction Hierarchies is a successful speedup-technique to Dijkstra’s seminal shortest path algorithm that has a convenient trade-off between preprocessing and query times. We investigate a shared-memory parallel implementation that uses O(n + m) space for storing the graph and O(1) space for each core during preprocessing. The presented data structures and algorithms consequently exploits ca...

متن کامل

Politeness Orientation in Social Hierarchies in Urdu

The present research is aimed at investigating how the politeness of the speakers of Urdu is influenced by their relative social status in society. The researcher took politeness theory of Brown and Levinson (1978, 1987) as a model. To observe politeness of Urdu speakers, speech act of apology with different strategies was selected. A Discourse Completion Task (DCT) was used as an instrument to...

متن کامل

Cache Write Policy for Streaming Output Data

This paper presents the results of a cache memory hierarchy evaluation that demonstrates multimedia applications are significantly influenced by the cache write policy of the L1 data cache. As part of an initial investigation of the memory characteristics of multimedia applications, we have been exploring multi-level cache memory hierarchies to evaluate the memory bottlenecks in media processin...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2002